Generalizing GraphPlan by Formulating Planning as a CSP
نویسندگان
چکیده
Recently, the notion of accrual of arguments has received some attention from the argumentation community. Three principles for argument accrual have been identified as necessary to hold in argumentation frameworks. In this paper we propose an approach to model the accrual of arguments in the context of Defeasible Logic Programming, a logic programming approach to argumentationwhich has proven to be successful for many real-world applications. We will analyze the above mentioned principles in the context of our proposal, studying other interesting properties.
منابع مشابه
Solving Planning-Graph by Compiling It into CSP
Although the deep affinity between Graphplan’s backward search, and the process of solving constraint satisfaction problems has been noted earlier, these relations have hither-to been primarily used to adapt CSP search techniques into the backward search phase of Graphplan. This paper describes GP-CSP, a system that does planning by automatically converting Graphplan’s planning graph into a CSP...
متن کاملRealPlan: Decoupling Causal and Resource Reasoning in Planning
Recent work has demonstrated that treating resource reasoning separately from causal reasoning can lead to improved planning performance and rational resource management where increase in resources does not degrade planning performance. However, the resources were scheduled procedurally and limited to cases that could be solved backtrackfree. Terming the decoupled framework as RealPlan, in this...
متن کاملEvaluation Strategies for Planning as Satisfiability
Jussi Rintanen August 26, ECAI’04 1/49 This work • We consider evaluation strategies for satisfiability planning: find a (not necessarily shortest) plan. Trade-off: quality vs. cost to produce. • Application domain: any approach to planning in which basic step is finding a plan of a given length (like planning as satisfiability (or CSP, MILP, ...), Graphplan, ...) • Significance: speed-ups of 0...
متن کاملPlanning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan
This paper reviews the connections between Graphplan’s planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search techniques to the Graphplan algorithm. It then describes how explanation based learning, dependency directed backtracking, dynamic variable ordering, forward checking, sticky values and random-restart search strategies can be adapte...
متن کاملPlanning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search
Most recent strides in scaling up planning have centered around two competing themes–disjunctive planners, exemplified by Graphplan, and heuristic state search planners, exemplified by UNPOP, HSP and HSP-r. In this paper, we present a novel approach for successfully harnessing the advantages of the two competing paradigms to develop planners that are significantly more powerful than either of t...
متن کامل